Compatibility of subsystem states and convex geometry
نویسندگان
چکیده
منابع مشابه
Compatibility of subsystem states and convex geometry
The subsystem compatibility problem, which concerns the question of whether a set of subsystem states are compatible with a state of the entire system, has received much study. Here we attack the problem from a new angle, utilising the ideas of convexity that have been successfully employed against the separability problem. Analogously to an entanglement witness, we introduce the idea of a comp...
متن کاملSubsystem pseudopure states
A critical step in experimental quantum information processing QIP is to implement control of quantum systems protected against decoherence via informational encodings, such as quantum error-correcting codes, noiseless subsystems, and decoherence-free subspaces. These encodings lead to the promise of fault-tolerant QIP, but they come at the expense of resource overheads. Part of the challenge i...
متن کاملConvex and Discrete Geometry
Geir Agnarsson, Jill Bigley Dunham.* George Mason University, Fairfax, VA. Extremal coin graphs in the Euclidean plane. A coin graph is a simple geometric intersection graph where the vertices are represented by non-overlapping closed disks in the Euclidean plane and where two vertices are connected if their corresponding disks touch. The problem of determining the maximum number of edges of a ...
متن کاملConvex Geometry and Stoichiometry
We demonstrate the benefits of a convex geometric perspective for questions on chemical stoichiometry. We show that the balancing of chemical equations, the use of “mixtures” to explain multiple stoichiometry, and the half-reaction for balancing redox actions all yield nice convex geometric interpretations. We also relate some natural questions on reaction mechanisms with the enumeration of lat...
متن کاملConvex Geometry of Orbits
We study metric properties of convex bodies B and their polars B, where B is the convex hull of an orbit under the action of a compact group G. Examples include the Traveling Salesman Polytope in polyhedral combinatorics (G = Sn, the symmetric group), the set of nonnegative polynomials in real algebraic geometry (G = SO(n), the special orthogonal group), and the convex hull of the Grassmannian ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2007
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.75.032102